A Dynamic Job Grouping-Based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids
نویسندگان
چکیده
Although Grids have been used extensively for executing applications with compute-intensive jobs, there exist several applications with a large number of lightweight jobs. The overall processing undertaking of these applications involves high overhead time and cost in terms of (i) job transmission to and from Grid resources and, (ii) job processing at the Grid resources. Therefore, there is a need for an efficient job grouping-based scheduling system to dynamically assemble the individual fine-grained jobs of an application into a group of jobs, and send these coarse-grained jobs to the Grid resources. This dynamic grouping should be done based on the processing requirements of each application, Grid resources’ availability and their processing capability. In this paper, we present a scheduling strategy that performs dynamic job grouping activity at runtime and convey the detailed analysis by running simulations. In addition, job processing granularity size is introduced to facilitate the job grouping activity in determining the total amount of jobs that can be processed in a resource within a specified time.
منابع مشابه
An Efficient Approach to Task Scheduling in Computational Grids
The Resource management in a grid environment is complex. Scheduling strategy plays an important role in the grid environment to schedule the user jobs, and dispatch them to appropriate grid resources. A good task scheduling method is essential to reduce the total time taken for job execution in the grid. In a grid environment, the jobs are processed at the grid resources in a fine-grained form...
متن کاملGrouping Based User Demand Aware Job Scheduling Approach for Computational Grid
Grid Computing is a high performance computing that solves complicated tasks and provides powerful computing abilities. Scheduler is very much responsible for effective utilization of resources and less processing time. Most of the scheduling algorithms failed to consider user satisfaction and resource utilization. This paper introduces a new grouping based scheduling algorithm that takes user ...
متن کاملCost-based Job grouping and Scheduling Algorithm for Grid computing Environments
The integration of remote and diverse resources and the increasing computational needs of Grand challenges problems combined with faster growth of the internet and communication technologies leads to the development of global computational grids. Grid computing is a prevailing technology, which unites underutilized resources in order to support sharing of resources and services distributed acro...
متن کاملSurvey of Resource and Grouping Based Job Scheduling Algorithm in Grid Computing
Grid computing is distributed computing environment, which enabling the dynamic selection, sharing resources based on availability, capability, performance or cost of these computing resource and simultaneously also based on organization specific requirements. The main purpose of Grid computing is to share the computational power, storage memory, network resource to solve a large problem. The g...
متن کاملComparative Analysis of Job Grouping based
Grid computing is a form of distributed computing that provides a platform for executing large-scale resource intensive applications on a number of heterogeneous computing systems across multiple administrative domains. Therefore, Grid platforms enable sharing, exchange, discovery, selection, and aggregation of distributed heterogeneous resources such as computers, databases and visualization d...
متن کامل